90 research outputs found
Large induced subgraphs with vertices of almost maximum degree
In this note we prove that for every integer , there exist constants
and such that the following holds. If is a graph on
vertices with maximum degree then it contains an induced subgraph
on at least vertices, such that has
vertices of the same degree of order at least . This solves
a conjecture of Caro and Yuster up to the constant .Comment: 6 page
An improved upper bound on the maximum degree of terminal-pairable complete graphs
A graph is terminal-pairable with respect to a demand multigraph on
the same vertex set as , if there exists edge-disjoint paths joining the end
vertices of every demand edge of . In this short note, we improve the upper
bound on the largest with the property that the complete graph on
vertices is terminal-pairable with respect to any demand multigraph of
maximum degree at most . This disproves a conjecture originally
stated by Csaba, Faudree, Gy\'arf\'as, Lehel and Schelp.Comment: 4 page
A Canonical Polynomial Van der Waerden's Theorem
We prove a canonical polynomial Van der Waerden's Theorem. More precisely, we
show the following. Let be a set of polynomials such
that and , for every .
Then, in any colouring of , there exist such
that forms either a monochromatic or a rainbow
set.Comment: 9 page
A note on long powers of paths in tournaments
A square of a path on vertices is a directed path , where
is directed to , for every . Recently,
Yuster showed that any tournament on vertices contains a square of a path
of length at least . In this short note, we improve this bound. More
precisely, we show that for every , there exists
such that any tournament on vertices contains a square
of a path on at least vertices.Comment: 5 page
Partitioning a graph into monochromatic connected subgraphs
A well-known result by Haxell and Kohayakawa states that the vertices of an
-coloured complete graph can be partitioned into monochromatic connected
subgraphs of distinct colours; this is a slightly weaker variant of a
conjecture by Erd\H{o}s, Pyber and Gy\'arf\'as that states that there exists a
partition into monochromatic connected subgraphs. We consider a variant
of this problem, where the complete graph is replaced by a graph with large
minimum degree, and prove two conjectures of Bal and DeBiasio, for two and
three colours.Comment: 14 pages, 2 figure
Long cycles in Hamiltonian graphs
We prove that if an -vertex graph with minimum degree at least
contains a Hamiltonian cycle, then it contains another cycle of length
; this implies, in particular, that a well-known conjecture of Sheehan
from 1975 holds asymptotically. Our methods, which combine constructive,
poset-based techniques and non-constructive, parity-based arguments, may be of
independent interest.Comment: 15 pages, submitted, some typos fixe
Partite Saturation of Complete Graphs
We study the problem of determining , the minimum number of edges
in a -partite graph with vertices in each part such that is
-free but the addition of an edge joining any two non-adjacent vertices
from different parts creates a . Improving recent results of Ferrara,
Jacobson, Pfender and Wenger, and generalizing a recent result of Roberts, we
define a function such that as
. Moreover, we prove that and show that the lower bound is tight
for infinitely many values of and every . This allows us to
prove that, for these values, as . Along the way, we disprove a conjecture and answer a question of the
first set of authors mentioned above.Comment: 22 pages, submitte
A large number of -coloured complete infinite subgraphs
Given an edge colouring of a graph with a set of colours, we say that the
graph is -\textit{coloured} if each of the colours is used. For an
-colouring of , the complete graph on
, we denote by the set all values
for which there exists an infinite subset such that
is -coloured. Properties of this set were first studied by
Erickson in . Here, we are interested in estimating the minimum size of
over all -colourings of .
Indeed, we shall prove the following result. There exists an absolute constant
such that for any positive integer , , for any -colouring of ,
thus proving a conjecture of Narayanan. This result is tight up to the order of
the constant .Comment: 22 page
Rainbow saturation of graphs
In this paper we study the following problem proposed by Barrus, Ferrara,
Vandenbussche, and Wenger. Given a graph and an integer , what is
, the minimum number
of edges in a -edge-coloured graph on vertices such that does
not contain a rainbow copy of , but adding to a new edge in any colour
from creates a rainbow copy of ? Here, we completely
characterize the growth rates of as a function of , for any graph belonging to
a large class of connected graphs and for any . This classification
includes all connected graphs of minimum degree . In particular, we prove
that , for any and , thus resolving a conjecture
of Barrus, Ferrara, Vandenbussche, and Wenger. We also pose several new
problems and conjectures.Comment: 20 page
Fiber surfaces from alternating states
In this paper we define alternating Kauffman states of links and we
characterize when the induced state surface is a fiber. In addition, we give a
different proof of a similar theorem of Futer, Kalfagianni and Purcell on
homogeneous states.Comment: 11 pages, 10 figures; Accepted for publication in Algebraic and
Geometric Topolog
- …